On Canonical Bases and Internality Criteria
نویسندگان
چکیده
A criterion is given for a strong type in a finite rank stable theory T to be (almost) internal to a given nonmodular minimal type. The motivation comes from results of Campana which give criteria for a compact complex analytic space to be “algebraic” (namely Moishezon). The canonical base property for a stable theory states that the type of the canonical base of a stationary type over a realisation is almost internal to the minimal types of the theory. It is conjectured that every finite rank stable theory has the canonical base property. It is shown here, that in a theory with the canonical base property, if p is a stationary type for which there exists a family of types qb, each internal to a nonlocally modular minimal type r, and such that any pair of independent realisations of p are “connected” by the qb’s, then p is almost internal to r.
منابع مشابه
On Canonical Bases and Internality Criteria Rahim Moosa and Anand Pillay
A criterion is given for a strong type in a finite rank stable theory T to be (almost) internal to a given nonmodular minimal type. The motivation comes from results of Campana [5] which give criteria for a compact complex analytic space to be “algebraic” (namely Moishezon). The canonical base property for a stable theory states that the type of the canonical base of a stationary type over a re...
متن کاملThe contribution of disease activity on functional limitations over time through psychological mediators: a 12-month longitudinal study in patients with ankylosing spondylitis.
OBJECTIVES To explore whether helplessness, internality and depression would mediate the relationship between disease activity and functional limitations in patients with AS in a 12-month longitudinal study. METHODS A total of 294 participants with AS meeting modified New York criteria completed clinical and psychological assessments at 6-month intervals. Psychological measures evaluated help...
متن کاملApplying Buchberger's criteria on Montes's DisPGB algorithm
The concept of comprehensive Grobner bases was introduced by Weispfenning. Montes has proposed an efficient algorithm for computing these bases. But he has not explicitly used Buchberger's criteria in his algorithm. In this paper we prove that we can apply these criteria on Montes algorithm. We propose a modified version of Montes algorithm and evaluate its performance via some examples.
متن کاملOn Definable Galois Groups and the Strong Canonical Base Property
In [3], Hrushovski and the authors proved, in a certain finite rank environment, that rigidity of definable Galois groups implies that T has the canonical base property in a strong form; “ internality to” being replaced by “algebraicity in”. In the current paper we give a reasonably robust definition of the “strong canonical base property” in a rather more general finite rank context than [3], ...
متن کاملDifference fields and descent in algebraic dynamics - I ∗
We draw a connection between the model-theoretic notions of modularity (or one-basedness), orthogonality and internality, as applied to difference fields, and questions of descent in in algebraic dynamics. In particular we prove in any dimension a strong dynamical version of Northcott's theorem for function fields, answering a question of Szpiro and Tucker and generalizing a theorem of Baker's ...
متن کامل